Ranking by inversion: A note on C.L. Dodgson

A note on equivalence in ranking investments

A note on ranking assignments using reoptimization

We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Computational results for the new algorithm are presented.

A note on inversion of Toeplitz matrices

It is shown that the invertibility of a Toeplitz matrix can be determined through the solvability of two standard equations. The inverse matrix can be denoted as a sum of products of circulant matrices and upper triangular Toeplitz matrices. The stability of the inversion formula for a Toeplitz matrix is also considered. c © 2007 Elsevier Ltd. All rights reserved.

Note on Inversion Formula to Determine Binary Elements by Astrometry

Simplified solutions to determine binary elements by astrometry were obtained in terms of elementary functions (Asada et al. 2004), and therefore require neither iterative nor numerical methods. In the framework of the simplified solution, this paper discusses the remaining two parameters of the time of periastron passage and the longitude of ascending node in order to complete the solution. We...

A note on Möbius inversion over power set lattices

In this paper, we establish a theorem on Möbius inversion over power set lattices which strongly generalizes an early result of Whitney on graph colouring.